Evolutionary Search in Inductive Equational Logic Programming

نویسنده

  • Lutz H Hamel
چکیده

Concept learning is the induction of a description from a set of examples. Inductive logic programming can be considered a special case of the general notion of concept learning specifically referring to the induction of first-order theories. Both concept learning and inductive logic programming can be seen as a search over all possible sentences in some representation language for sentences that correctly explain the examples and also generalize to other sentences that are part of that concept. In this paper we explore inductive logic programming with equational logic as the representation language. We present a high-level overview of the implementation of inductive equational logic using genetic programming and discuss encouraging results based on experiments that are intended to emulate real world scenarios.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Breeding Algebraic Structures - An Evolutionary Approach To Inductive Equational Logic Programming

Concept learning is the induction of a description from a set of examples. Inductive logic programming can be considered a special case of the general notion of concept learning specifically referring to the induction of first-order theories. Both concept learning and inductive logic programming can be seen as a search over all possible sentences in some representation language for sentences th...

متن کامل

An Inductive Programming Approach to Algebraic Specification

Inductive machine learning suggests an alternative approach to the algebraic specification of software systems: rather than using test cases to validate an existing specification we use the test cases to induce a specification. In the algebraic setting test cases are ground equations that represent specific aspects of the desired system behavior or, in the case of negative test cases, represent...

متن کامل

Evolutionary Concept Learning in Equational Logic by Chi Shen a Thesis Submitted in Partial Fulfillment of the Requirements of Master of Science in Computer Science University of Rhode Island

Concept learning is a branch of machine learning concerned with learning how to discriminate and categorize things based on positive and negative examples. More specifically, the learning algorithm induces a description of the concept (in some representation language) from a set of positive and negative facts. Inductive logic programming can be considered a subcategory of concept learning where...

متن کامل

P ROCEEDINGS OF THE W ORKSHOP ON A PPROACHES AND A PPLICATIONS OF I NDUCTIVE P ROGRAMMING AAIP ’ 07 September 17 , 2007 Warsaw , Poland

Inductive machine learning suggests an alternative approach to the algebraic specification of software systems: rather than using test cases to validate an existing specification we use the test cases to induce a specification. In the algebraic setting test cases are ground equations that represent specific aspects of the desired system behavior or, in the case of negative test cases, represent...

متن کامل

Lazy Unification with Inductive Simplification

Unification in the presence of an equational theory is an important problem in theorem-proving and in the integration of functional and logic programming languages. This paper presents an improvement of the proposed lazy unification methods by incorporating simplification with inductive axioms into the unification process. Inductive simplification reduces the search space so that in some case i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994